ON FACTORIZATION OF MEROMORPHIC FUNCTIONS WITH FINITELY MANY POLES
نویسندگان
چکیده
منابع مشابه
On solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملUnivalent holomorphic functions with fixed finitely many coefficients involving Salagean operator
By using generalized Salagean differential operator a newclass of univalent holomorphic functions with fixed finitely manycoefficients is defined. Coefficient estimates, extreme points,arithmetic mean, and weighted mean properties are investigated.
متن کاملon solubility of groups with finitely many centralizers
for any group g, let c(g) denote the set of centralizers of g.we say that a group g has n centralizers (g is a cn-group) if |c(g)| = n.in this note, we prove that every finite cn-group with n ≤ 21 is soluble andthis estimate is sharp. moreover, we prove that every finite cn-group with|g| < 30n+1519 is non-nilpotent soluble. this result gives a partial answer to aconjecture raised by a. ashrafi in ...
متن کاملApproximation by Radial Basis Functions with Finitely Many Centers
Interpolation by translates of \radial" basis functions is optimal in the sense that it minimizes the pointwise error functional among all comparable quasi{interpolants on a certain \native" space of functions F . Since these spaces are rather small for cases where is smooth, we study the behavior of interpolants on larger spaces of the form F 0 for less smooth functions 0. It turns out that in...
متن کاملProvability with finitely many variables
For every finite n ≥ 4 there is a logically valid sentence φn with the following properties: φn contains only 3 variables (each of which occurs many times); φn contains exactly one nonlogical binary relation symbol (no function symbols, no constants, and no equality symbol); φn has a proof in first-order logic with equality that contains exactly n variables, but no proof containing only n − 1 v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 1998
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.29.1998.4282